Projection methods, isotone projection cones, and the complementarity problem
نویسندگان
چکیده
منابع مشابه
The overall efficiency and projection point in network DEA
Data Envelopment Analysis (DEA) is one of the best methods for measuring the efficiency and productivity of Decision Making Units (DMU). Evaluating the efficiency of DMUs which have two or several stages by using the conventional DEA models, is equal to consider them as black box. This method, omits the effect of intermediate measure on efficiency. Therefore, just the first network inputs and t...
متن کاملApplying Projection-Based Methods to the Asymmetric Traffic Assignment Problem
This paper examines the application of a path-based algorithm, to the static and fixed demand asymmetric traffic assignment problem. The algorithm is of the simplicial decomposition type and it solves the equilibration or master problem step by means of five existing projection methods for variational inequality problems in order to evaluate their performance on real traffic networks. The proje...
متن کاملOn the nontrivial projection problem
TheNontrivial Projection Problem asks whether every finite-dimensional normed space admits a well-bounded projection of non-trivial rank and corank or, equivalently, whether every centrally symmetric convex body (of arbitrary dimension) is approximately affinely equivalent to a direct product of two bodies of non-trivial dimension. We show that this is true “up to a logarithmic factor.”
متن کاملProjection, Problem Space and Anchoring
When people make sense of situations, illustrations, instructions and problems they do more than just think with their heads. They gesture, talk, point, annotate, make notes and so on. What extra do they get from interacting with their environment in this way? To study this fundamental problem, I looked at how people project structure onto geometric drawings, visual proofs, and games like tic t...
متن کاملRelaxed Alternating Projection Methods
In this paper we deal with the von Neumann alternating projection method xk+1 = PAPBxk and with its generalization of the form xk+1 = PA(xk + k(PAPBxk xk)), where A;B are closed and convex subsets of a Hilbert space H and FixPAPB 6= ?. We do not suppose that A \ B 6= ?. We give su¢ cient conditions for the weak convergence of the sequence (xk) to FixPAPB in the general case and in the case A is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1990
ISSN: 0022-247X
DOI: 10.1016/0022-247x(90)90277-m